Real-time control with parametric timed reachability games
نویسندگان
چکیده
Timed game automata are used for solving control problems on real-time systems. A timed reachability game consists in finding a strategy for the controller for the system, modeled as a timed automaton. Such a controller says when and which of some "controllable" actions should be taken in order to reach "goal" states. We deal with a parametric version of timed game automata. We define parametric timed reachability games and introduce their subclass for which the existence of a parameter valuation, such that there is a strategy for the controller to reach the "goal" state, is decidable. We also propose a semi-algorithm to symbolically compute the corresponding set of parameter valuations.
منابع مشابه
ANR IMPRO Deliverable 5.1 Control tasks for Timed System; Robustness issues
Timed game automata are used for solving control problems on real-time systems. A timed reachability game consists in finding a strategy for the controller for the system, modeled as a timed automaton. Such a controller says when and which of some "controllable" actions should be taken in order to reach "goal" states. We deal with a parametric version of timed game automata. We define parametri...
متن کاملImproved Undecidability Results for Reachability Games on Recursive Timed Automata
We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recent...
متن کاملAlgorithms and data structures for parametric analysis of real-time systems
This document is intended to contribute to the area of validation and verification of communicating real time systems, with emphasis put on parametric reachability analysis of systems modeled using timed automata. Reachability analysis is a crucial aspect of validation and verification of software and hardware systems. The reachability analysis for real time systems is area that is studied by m...
متن کاملAdvances in Parametric Real-Time Reasoning
We study the decidability and complexity of the reachability problem in parametric timed automata. The problem was introduced 20 years ago by Alur, Henzinger, and Vardi in [1], where they showed decidability in the case of a single parametric clock, and undecidability for timed automata with three or more parametric clocks. By translating such problems as reachability questions in certain exten...
متن کاملReachability-Time Games on Timed Automata
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler showed decidability of reachability-time games on strongly non-Zeno timed automata using a value iteration algorithm. This paper complements their work by providing a strategy improvement algorithm for the problem. I...
متن کامل